Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
نویسندگان
چکیده
منابع مشابه
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
Given a set R of red points and a set B of blue points, the nearest-neighbour decision rule classifies a new point q as red (respectively, blue) if the closest point to q in R ∪ B comes from R (respectively, B). This rule implicitly partitions space into a red set and a blue set that are separated by a red-blue decision boundary. In this paper we develop outputsensitive algorithms for computing...
متن کاملParallel Nearest Neighbour Algorithms for Text Categorization
In this paper we describe the parallelization of two nearest neighbour classification algorithms. Nearest neighbour methods are well-known machine learning techniques. They have been successfully applied to Text Categorization task. Based on standard parallel techniques we propose two versions of each algorithm on message passing architectures. We also include experimental results on a cluster ...
متن کاملQuick Full Search Equivalent Algorithms for Nearest Neighbour Pattern Matching
We consider the problem of finding the closest match for a given target vector in a codebook of codeword vectors. We present an approach which makes it possible to obtain quick full-search equivalent methods for finding the closest match with respect to some distortion measure. Our algorithms assume that the distortion measure obeys the triangle inequality of metric spaces. Results indicate tha...
متن کاملNearest Neighbour Algorithms for Forecasting Call Arrivals in Call Centers
Companies and governments often rely on call centers to provide service to their customers. The call center industry is of great economic interest; It is rapidly expanding, in terms of workforce and economic scope [1]. Because of its importance a lot of studies have been, and are still being, conducted on modelling call centers. These models are being developed to help understand the performanc...
متن کاملNearest neighbour approach in the least-squares data imputation algorithms
Imputation of missing data is of interest in many areas such as survey data editing, medical documentation maintaining and DNA microarray data analysis. This paper is devoted to experimental analysis of a set of imputation methods developed within the so-called least-squares approximation approach, a non-parametric computationally effective multidimensional technique. First, we review global me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2005
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-004-1152-0